Symmetrized random permutations

نویسندگان

  • Jinho Baik
  • Eric M. Rains
چکیده

Selecting N random points in a unit square corresponds to selecting a random permutation. Placing symmetry restrictions on the points, we obtain special kinds of permutations : involutions, signed permutations and signed involutions. We are interested in the statistics of the length (in numbers of points) of the longest up/right path in each symmetry type as the number of points increases to infinity. The limiting distribution functions are expressed in terms of a Painlevé II equation. In addition to the Tracy-Widom distributions of random matrix theory, we also obtain two new classes of distribution functions interpolating between the GOE and GSE, and between the GUE and GOE Tracy-Widom distribution functions. Applications to random vicious walks and site percolation are also discussed

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetrized models of last passage percolation and non-intersecting lattice paths

It has been shown that the last passage time in certain symmetrized models of directed percolation can be written in terms of averages over random matrices from the classical groups U(l), Sp(2l) and O(l). We present a theory of such results based on non-intersecting lattice paths, and integration techniques familiar from the theory of random matrices. Detailed derivations of probabilities relat...

متن کامل

Increasing Subsequences in Nonuniform Random Permutations

Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing and decreasing subsequences in non-uniform random permutations.

متن کامل

Gl(n,q) and Increasing Subsequences in Nonuniform Random Permutations

Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing subsequence in non-uniform random permutations.

متن کامل

Lecture notes on Spatial Random Permutations

These notes accompany a sequence of lectures given at the Warsaw Probability Summer School on Spatial Random Permutations. Topics include random uniform and Ewens permutations, the interchange model and its analysis on the complete graph and on trees, a continuum model for spatial random permutations in Rd related to the Feynman-Kac representation of the ideal Bose gas and a discussion of model...

متن کامل

Symbolic-Numerical Algorithm for Generating Cluster Eigenfunctions: Identical Particles with Pair Oscillator Interactions

The quantum model of a cluster, consisting of A identical particles, coupled by the internal pair interactions and affected by the external field of a target, is considered. A symbolic-numerical algorithm for generating A−1-dimensional oscillator eigenfunctions, symmetric or antisymmetric with respect to permutations of A identical particles in the new symmetrized coordinates, is formulated and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999